Symmetric tensor decomposition by an iterative eigendecomposition algorithm
نویسندگان
چکیده
We present an iterative algorithm, called the symmetric tensor eigen-rank-one iterative decomposition (STEROID), for decomposing a symmetric tensor into a real linear combination of symmetric rank-1 unit-norm outer factors using only eigendecompositions and least-squares fitting. Originally designed for quartic (4th-order) symmetric tensors, STEROID is shown to be applicable to any order through an innovative tensor embedding technique. Numerical examples demonstrate the high efficiency and accuracy of the proposed scheme even for large scale problems.
منابع مشابه
Iterative Methods for Symmetric Outer Product Tensor Decomposition
We study the symmetric outer product for tensors. Specifically, we look at decomposition of fully (partially) symmetric tensor into a sum of rank-one fully (partially) symmetric tensors. We present an iterative technique for the third-order partially symmetric tensor and fourthorder fully and partially symmetric tensor. We included several numerical examples which indicate a faster convergence ...
متن کاملAn implicit QR algorithm for semiseparable matrices to compute the eigendecomposition of symmetric matrices
The QR algorithm is one of the classical methods to compute the eigendecomposition of a matrix. If it is applied on a dense n×n matrix, this algorithm requires O(n3) operations per iteration step. To reduce this complexity for a symmetric matrix to O(n), the original matrix is £rst reduced to tridiagonal form using orthogonal similarity transformations. In the report [Van Barel, Vandebril, Mast...
متن کاملAn Iterative Eigendecomposition Approach to Blind Source Separation
In this work we address the generalized eigendecomposition approach (GED) to the blind source separation problem. We present an alternative formulation for GED based on the definition of congruent pencils. Making use of this definition, and matrix block operations, the eigendecompostion approach to blind source separation is completely characterized. We also present an iterative method to compu...
متن کاملResidual norm steepest descent based iterative algorithms for Sylvester tensor equations
Consider the following consistent Sylvester tensor equation[mathscr{X}times_1 A +mathscr{X}times_2 B+mathscr{X}times_3 C=mathscr{D},]where the matrices $A,B, C$ and the tensor $mathscr{D}$ are given and $mathscr{X}$ is the unknown tensor. The current paper concerns with examining a simple and neat framework for accelerating the speed of convergence of the gradient-based iterative algorithm and ...
متن کاملRecursive eigendecomposition via autoregressive analysis and ago-antagonistic regularization
A new recursive eigendecomposition algorithm of Complex Hermitian Tœplitz matrices is studied. Based on Trench’s inversion of Tœplitz matrices from their autoregressive analysis, we have developed a fast recursive iterative algorithm that takes into account the rank-one modification of successive order Toeplitz matrices. To speed up the computational time and to increase numerical stability of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Computational Applied Mathematics
دوره 308 شماره
صفحات -
تاریخ انتشار 2016